Optimization of network robustness to random breakdowns
نویسندگان
چکیده
منابع مشابه
Optimization of network robustness to random breakdowns
We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes N and a given cost—which we take as the average number of connections per node hki. We find that the network design that maximizes f c, the fraction of nodes that are randomly removed before global connectivity is lost, consists of q 1⁄4 1⁄2ðhki 1Þ= ffiffi h p ki ffiffi...
متن کاملResilience of the internet to random breakdowns
A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck(-alpha). We study the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, p(c), that need...
متن کاملOptimization of network robustness to waves of targeted and random attacks.
We study the robustness of complex networks to multiple waves of simultaneous (i) targeted attacks in which the highest degree nodes are removed and (ii) random attacks (or failures) in which fractions p(t) and p(r) , respectively, of the nodes are removed until the network collapses. We find that the network design which optimizes network robustness has a bimodal degree distribution, with a fr...
متن کاملOptimization of Robustness of Scale-free Network to Random and Targeted Attacks
The scale-fee networks, having connectivity distribution P (k) ∼ k−α (where k is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attack maximum while keeping the average connectivity < k > per node ...
متن کاملEntropy Optimization of Scale-Free Networks Robustness to Random Failures
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow p(k) ∼ ck−α. We study the robustness of scale-free networks to random failures from the character of their heterogeneity. Entropy of the degree distribution can be an average measure of a network’s heterogeneity. Optimization of scale-free netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2006
ISSN: 0378-4371
DOI: 10.1016/j.physa.2006.02.044